Approximate dynamic programming for dynamic capacity allocation with multiple priority levels
نویسندگان
چکیده
منابع مشابه
Approximate Dynamic Programming for Dynamic Capacity Allocation with Multiple Priority Levels
In this paper, we consider a quite general dynamic capacity allocation problem. There is a fixed amount of daily processing capacity. On each day, jobs of different priorities arrive randomly and we need to decide which jobs should be scheduled for which days. Waiting jobs incur a holding cost depending on their priority levels. The objective is to minimize the total expected cost over a finite...
متن کاملApproximate Dynamic Programming for Large-Scale Resource Allocation Problems
We present modeling and solution strategies for large-scale resource allocation problems that take place over multiple time periods under uncertainty. In general, the strategies we present formulate the problem as a dynamic program and replace the value functions with tractable approximations. The approximations of the value functions are obtained by using simulated trajectories of the system a...
متن کاملApproximate dynamic programming with affine ADDs
context-specific additive multiplicative ! " # # ! # ! " # $ # #% "& #% "&
متن کاملApproximate dynamic programming with a fuzzy parameterization
Dynamic programming (DP) is a powerful paradigm for general, nonlinear optimal control. Computing exact DP solutions is in general only possible when the process states and the control actions take values in a small discrete set. In practice, it is necessary to approximate the solutions. Therefore, we propose an algorithm for approximate DP that relies on a fuzzy partition of the state space, a...
متن کاملApproximate Counting by Dynamic Programming
This proposal describes a project that is going to investigate algorithms for counting knapsack solutions and related sets, with a focus on algorithms that utilise dynamic programming. Both the feasibility of the implementation and the performance characteristics of the algorithms are going to be examined; additional goals pertain to actual algorithmic improvements, with derandomisation being t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IIE Transactions
سال: 2010
ISSN: 0740-817X,1545-8830
DOI: 10.1080/0740817x.2010.504690